Sortable Elements in Infinite Coxeter Groups

نویسنده

  • NATHAN READING
چکیده

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing partitions associated to Artin groups of finite type. In this paper, as the first step towards expanding these applications beyond finite type, we study sortable elements in a general Coxeter group W . We supply uniform arguments which transform all previous finite-type proofs into uniform proofs (rather than type by type proofs), generalize many of the finite-type results and prove new and more refined results. The key tools in our proofs include a skew-symmetric form related to (a generalization of) the Euler form of quiver theory and the projection πc ↓ mapping each element of W to the unique maximal c-sortable element below it in the weak order. The fibers of πc ↓ essentially define the c-Cambrian fan. The most fundamental results are, first, a precise statement of how sortable elements transform under (BGP) reflection functors and second, a precise description of the fibers of πc ↓ . These fundamental results and others lead to further results on the lattice theory and geometry of Cambrian (semi)lattices and Cambrian fans.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clusters, Coxeter-sortable Elements and Noncrossing Partitions

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.

متن کامل

Sortable Elements for Quivers with Cycles

Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W . In this paper, we define a more general notion of Ω-sortable elements, where Ω is an arbitrary orientation of the diagram, and show that the key properties of c-sortable elements...

متن کامل

SB-Labelings, Distributivity and Bruhat Order on Sortable Elements

In this article, we investigate the set of γ-sortable elements, associated with a Coxeter group W and a Coxeter element γ ∈ W , under Bruhat order, and we denote this poset by Bγ . We show that this poset belongs to the class of SB-lattices recently introduced by Hersh and Mészáros, by proving a more general statement, namely that all join-distributive lattices are SB-lattices. The observation ...

متن کامل

Non-crossing Partitions, Non-nesting Partitions and Coxeter Sortable Elements in Types a and B

First, we investigate a generalization of the area statistic on Dyck paths for all crystallographic reflection groups. In particular, we explore Dyck paths of type B together with an area statistic and a major index. Then, we construct bijections between non-nesting and reverse non-crossing partitions for types A and B. These bijections simultaneously send the area statistic and the major index...

متن کامل

Bounding Reflection Length in an Affine Coxeter Group

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008